An Improved Fast Feature-Based Block Motion Estimation
نویسندگان
چکیده
A fast block matching algorithm in the feature domain was proposed by Fok and Au which achieves a computation reduction factor of N/2 with search block size of N×N. This paper presents an improved fast block matching algorithm in the integral projections feature domain. This algorithm is based on the fast block matching algorithm in the feature domain and a new motion field sub-sampling scheme. By utilizing the properties of the features and the motion field sub-sampling scheme, with a search block size of N×N, the improved algorithm can achieve a computation reduction factor of N while retaining close-to-optimal performance in the mean absolute difference (MAD) sense.
منابع مشابه
Adaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملA new predictive search area approach for fast block motion estimation
According to the observation on the distribution of motion differentials among the motion vector of any block and those of its four neighboring blocks from six real video sequences, this paper presents a new predictive search area approach for fast block motion estimation. Employing our proposed simple predictive search area approach into the full search (FS) algorithm, our improved FS algorith...
متن کاملNovel Block Motion Estimation Based on Adaptive Search Patterns
An improved algorithm for fast motion estimation based on the block matching algorithm (BMA) is presented for use in a blockbased video coding system. To achieve enhanced motion estimation performance, we propose an adaptive search pattern length for each iteration for the current macro block (MB). In addition, search points that must be checked are determined by means of directional informatio...
متن کاملNovel fast block motion estimation in feature subspace
Motion estimation and compensation are widely used in video coding. This paper presents two fast block matching algorithms for motion estimation. These algorithms use the subspace features of a block to determine the block distance. With a search block size of N×N, the proposed algorithms can achieve a computation reduction factor of N/2 while retaining close-to-optimal performance in the mean ...
متن کاملBlock motion estimation based on selective integral projections
Existing fast block motion estimation algorithms, which try to reduce the number of search points, utilize the motion vector (MV) characteristics of high spatial correlation as well as center-biased distribution, in predicting an initial MV. Even though they provide good performance for slow motion sequences, they suffer from poor accuracy for fast or complex motion sequences. In this paper, we...
متن کامل